On Primitive Subdivisions of an Elementary Tetrahedron
نویسندگان
چکیده
A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary. An L-elementary tetrahedron has volume ≥ (1/6). det(L), in case equality holds it is called L-primitive. A result of Knudsen, Mumford and Waterman, tells us that any convex polytope P admits a linear simplicial subdivision into tetrahedra which are primitive with respect to the bigger lattice (1/2).L, for some t depending on P . Improving this, we show that in fact the lattice (1/4).L always suffices. To this end, we first characterize all L-elementary tetrahedra for which even the intermediate lattice (1/2).L suffices.
منابع مشابه
On primitive symmetric association schemes with m1=3
We classify primitive symmetric association schemes with m1 = 3. Namely, it is shown that the tetrahedron, i.e., the association scheme of the complete graph K4, is the unique such association scheme. Our proof of this result is based on the spherical embeddings of association schemes and elementary three dimensional Euclidean geometry.
متن کاملData-driven Tetrahedral Mesh Subdivision
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitrary locations. An advantage of the method presented is that it requires few subdivisions and all decisions are made locally at each tetrahedron. We discuss the algorithm’s performance and applications.
متن کاملClosure Polynomials for Strips of Tetrahedra
A tetrahedral strip is a tetrahedron-tetrahedron truss where any tetrahedron has two neighbors except those in the extremes which have only one. Unless any of the tetrahedra degenerate, such a truss is rigid. In this case, if the distance between the strip endpoints is imposed, any rod length in the truss is constrained by all the others to attain discrete values. In this paper, it is shown how...
متن کاملThe Flip Diameter of Rectangulations and Convex Subdivisions
We study the configuration space of rectangulations and convex subdivisions of n points in the plane. It is shown that a sequence of O(n log n) elementary flip and rotate operations can transform any rectangulation to any other rectangulation on the same set of n points. This bound is the best possible for some point sets, while Θ(n) operations are sufficient and necessary for others. Some of o...
متن کاملPrimitive coherent configurations: On the order of uniprimitive permutation groups
These notes describe the author’s elementary graph theoretic proof of the nearly tight exp(4 √ n ln n) bound on the order of primitive, not doubly transitive permutation groups (Ann. Math., 1981 ). The exposition incorporates a lemma by V. N. Zemlyachenko that simplifies the proof. The central concept in the proof is primitive coherent configurations, a combinatorial relaxation of the action of...
متن کامل